Concurrent Two-Dimensional State Minimization and State Assignment of finite State Machines

A generalization of the classical state minimization of a Finite State Machine FSM is described The FSM is minimized here in two dimensions numbers of both input symbols and internal states are mini mized in an iterative sequence of input minimizatio and state minimization procedures For each machine in the sequence of FSMs created by the algorithm an equivalent FSM is found that attempts to minimize the state assignment by selecting in each cell of the tran sition map one successor state from the set of suc cessors This approach leads to a partitioned realiza tion of the FSM with an input encoder Our e cient branch and bound program FMINI produces an exact minimum result for each component minimization pro cess and a globally quasi minimum solution to the en tire two dimensional D FSM process of state mini mization and state assignment